A knowledge server for reasoning about temporal constraints between classes and instances of events

Reasoning with temporal constraints is a ubiquitous issue in many computer science tasks, for which many dedicated approaches have been and are being built. In particular, in many areas, including planning, workflow, guidelines and protocol management, one needs to represent and reason with temporal constraints between classes of events (e.g., between the types of actions needed to achieve a goal) and temporal constraints between instances of events (e.g., between the specific actions being executed). The temporal constraints between the classes of events must be inherited by the instances, and the consistency of both types of constraints must be checked. In this paper, we design a general-purpose domain-independent knowledge server dealing with these issues. In particular, we propose a formalism to represent temporal constraints, and we point out two orthogonal parameters that affect the definition of reasoning algorithms operating on them. We then show four algorithms to deal with inheritance and to perform temporal consistency checking (depending on the parameters) and we study their properties. Finally, we report the results we obtained by applying our system to the treatment of temporal constraints in clinical guidelines.